IA Algorithm Acceleration Using GPUs

نویسندگان

  • Antonio Seoane
  • Alberto Jaspe Villanueva
چکیده

Graphics Processing Units (GPUs) have been evolving very fast, turning into high performance programmable processors. Though GPUs have been designed to compute graphics algorithms, their power and flexibility makes them a very attractive platform for generalpurpose computing. In the last years they have been used to accelerate calculations in physics, computer vision, artificial intelligence, database operations, etc. (Owens, 2007). In this paper an approach to general purpose computing with GPUs is made, followed by a description of artificial intelligence algorithms based on Artificial Neural Networks (ANN) and Evolutionary Computation (EC) accelerated using GPU.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approach to Improve Particle Swarm Optimization Algorithm Using CUDA

The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...

متن کامل

Accelerating the ANSYS Direct Sparse Solver with GPUs

As hardware accelerators and especially GPUs become more and more popular to accelerate the compute intensive parts of an algorithm, standard high performance computing packages are starting to benefit from this trend. We present the first GPU acceleration of the ANSYS direct sparse solver. We explain how such a multifrontal solver may be accelerated using an optimized dense matrix factorizatio...

متن کامل

Smith-Waterman Acceleration in Multi-GPUs: A Performance per Watt Analysis

We present a performance per watt analysis of CUDAlign 4.0, a parallel strategy to obtain the optimal alignment of huge DNA sequences in multi-GPU platforms using the exact Smith-Waterman method. Speed-up factors and energy consumption are monitored on different stages of the algorithm with the goal of identifying advantageous scenarios to maximize acceleration and minimize power consumption. E...

متن کامل

Image-Space Acceleration for Direct Volume Rendering of Unstructured Grids using Joint Bilateral Upsampling

We describe a new image-space acceleration technique that allows real-time direct volume rendering of large unstructured volumes. Our algorithm operates as a simple post-process and can be used to improve the performance of any existing volume renderer that is sensitive to image size. A joint bilateral upsampling filter allows images to be rendered efficiently at a fraction of their original si...

متن کامل

Why do commodity graphics hardware boards (GPUs) work so well for acceleration of computed tomography?

Commodity graphics hardware boards (GPUs) have achieved remarkable speedups in various sub-areas of Computed Tomography (CT). This paper takes a close look at the GPU architecture and its programming model and describes a successful acceleration of Feldkamp’s cone-beam CT reconstruction algorithm. Further, we will also have a comparative look at the new emerging Cell architecture in this regard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009